41![Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized](https://www.pdfsearch.io/img/552ba106f949553b93b2f0d77d1a9bf1.jpg) | Add to Reading ListSource URL: www14.in.tum.deLanguage: English - Date: 2013-11-25 11:07:04
|
---|
42![VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms](https://www.pdfsearch.io/img/fa1fbf87b28232e8bbd59e37d51ab104.jpg) | Add to Reading ListSource URL: www.vsgc.odu.eduLanguage: English - Date: 2013-05-02 13:43:42
|
---|
43![ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti](https://www.pdfsearch.io/img/4b01545e05218a233ee2636607932eab.jpg) | Add to Reading ListSource URL: www.crypto.ethz.chLanguage: English - Date: 2015-07-07 05:51:55
|
---|
44![A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri](https://www.pdfsearch.io/img/714db96252e3e1fff1609d88c70e8629.jpg) | Add to Reading ListSource URL: spcl.inf.ethz.chLanguage: English - Date: 2014-09-17 16:23:24
|
---|
45![Computing Fundamentals Computational Complexity Salvatore Filippone–2015 Computing Fundamentals Computational Complexity Salvatore Filippone–2015](https://www.pdfsearch.io/img/24204c9322e7aaae2484e9fdb7853182.jpg) | Add to Reading ListSource URL: people.uniroma2.itLanguage: English - Date: 2015-06-11 10:49:26
|
---|
46![A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically](https://www.pdfsearch.io/img/68b246148af2ccf0fa86f7d3bd5e0dcd.jpg) | Add to Reading ListSource URL: www.nada.kth.seLanguage: English - Date: 2012-05-30 08:52:53
|
---|
47![A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar](https://www.pdfsearch.io/img/e2e8391d2f755f4f838477d9f0a10007.jpg) | Add to Reading ListSource URL: www.cs.cmu.eduLanguage: English - Date: 2009-03-26 07:24:20
|
---|
48![On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +](https://www.pdfsearch.io/img/0ae90594ae492e71322cfd4e2b39e41e.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2015-05-18 12:16:02
|
---|
49![COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used](https://www.pdfsearch.io/img/9b822ce5dd529efa87b8d46df81284b4.jpg) | Add to Reading ListSource URL: www.amsterdamoptimization.comLanguage: English - Date: 2011-03-16 12:56:11
|
---|
50![Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013 Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013](https://www.pdfsearch.io/img/d8147a2c1e4d0921361f6a4ef6633566.jpg) | Add to Reading ListSource URL: www.math.washington.eduLanguage: English - Date: 2013-11-01 17:11:36
|
---|